Completion and Invariant Theory in Symbolic Computation and Artificial Intelligence
نویسنده
چکیده
An outline for the study of invariant theoretic (as structural) and completion (as syntactical) concepts in symbolic computation and artiicial intelligence is presented on a level of abstraction which permits a unifying viewpoint on problems in symbolic computation and artiicial intelligence. We refer to applications in computational polynomial ideal theory and in general problem-solving in the sense of AI research.
منابع مشابه
A Computational Foundation for the Study of Cognition
Computation is central to the foundations of modern cognitive science, but its role is controversial. Questions about computation abound: What is it for a physical system to implement a computation? Is computation sufficient for thought? What is the role of computation in a theory of cognition? What is the relation between different sorts of computational theory, such as connectionism and symbo...
متن کاملThe Grand Challenges and Myths of Neural-Symbolic Computation
The construction of computational cognitive models integrating the connectionist and symbolic paradigms of artificial intelligence is a standing research issue in the field. The combination of logic-based inference and connectionist learning systems may lead to the construction of semantically sound computational cognitive models in artificial intelligence, computer and cognitive sciences. Over...
متن کاملArtificial Intelligence and the Natural World
Until recently, the symbolic knowledge representation school was the dominant school of thought in Artificial Intelligence. Its aim was to develop a computational theory of intelligence in which all thought was represented in symbolic, logical form, and intelligence itself was viewed primarily as a goal-oriented problem-solving activity. The world, in which thinking took place, was given little...
متن کاملDynamical Systems Theory for Transparent Symbolic Computation in Neuronal Networks
Giovanni Sirio Carmantini Dynamical Systems Theory for Transparent Symbolic Computation in Neuronal Networks In this thesis, we explore the interface between symbolic and dynamical system computation, with particular regard to dynamical system models of neuronal networks. In doing so, we adhere to a definition of computation as the physical realization of a formal system, where we say that a dy...
متن کاملSpecial issue on artificial intelligence and symbolic computation
ing symbolic matrices Special issue on artificial intelligence and symbolic computation Randa Almomen · Alan P. Sexton · Volker Sorge © Springer Science+Business Media B.V. 2012 Abstract We present a procedure that allows the abstraction of elements in concrete symbolic matrices to obtain a more compact representation employing ellipses in order to expose homogeneous regions present in a matrix...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992